1200C - Round Corridor - CodeForces Solution

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
#include <set>
using namespace std;
long long x1, x2, r, y2;
long long s1, s2;
long long gcd(long long a, long long b)
{
	return b == 0 ? a : gcd(b, a % b);
}
long long getid(long long a, long long b)
{
	if (a == 1) return (b - 1) / s1;
	else return(b - 1) / s2;
}
int main() {
	long long n, m, q;
	cin >> n >> m >> q;
	s1 = n / gcd(max(n, m), min(n, m));
	s2 = m / gcd(max(n, m), min(n, m));
	while (q--)
	{
		cin >> x1 >> x2 >> r >> y2;
		long long id1, id2;
		id1 = getid(x1, x2);
		id2 = getid(r, y2);
		if (id1 == id2) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}